Reach set computation using optimal control
نویسنده
چکیده
Reach set computation is a basic component of many veri cation and control synthesis procedures. E ective computation schemes are available for discrete systems described by nite state machines and continuous-variable systems described by linear di erential inequalities. This paper suggests an approach based on the Pontryagin maximum principle of optimal control theory. The approach is elaborated for linear systems, and it may prove useful for more general continuous-variable systems.
منابع مشابه
Aircraft Autolander Safety Analysis Through Optimal Control-Based Reach Set Computation
Amethod for thenumerical computation of reachable sets for hybrid systems is presented andapplied to thedesign and safety analysis of autoland systems. It is shown to be applicable to specific phases of landing: descent, flare, and touchdown. The method is based on optimal control and level set methods; it simultaneously computes a maximal controlled invariant set and a set-valued control law g...
متن کاملOPTIMAL DESIGN OF STEEL MOMENT FRAME STRUCTURES USING THE GA-BASED REDUCED SEARCH SPACE (GA-RSS) TECHNIQUE
This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...
متن کاملReach set computation and control synthesis for discrete-time dynamical systems with disturbances
Control problems with hard bounds on the control values, restrictions on the state trajectory over a finite time horizon, and guaranteed behavior despite the disturbances, are difficult to solve using frequency based design methods. Such problems have received much attention over the past decade. In order to address them one needs to study system evolution in the time domain. The central concep...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملGlobal optimal control of perturbed systems
We propose a new numerical method for the computation of the optimal value function of perturbed control systems and associated globally stabilizing optimal feedback controllers. The method is based on a set oriented discretization of state space in combination with a new algorithm for the computation of shortest paths in weighted directed hypergraphs. Using the concept of a multivalued game, w...
متن کامل